Lambda Logic
نویسنده
چکیده
Lambda logic is the union of first order logic and lambda calculus. The purpose of this note is to give a complete and precise definition of the syntax of lambda logic, and explain its relations to first order logic and to simple type theory. This is a revised and expanded version of [6].
منابع مشابه
Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach
Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p....
متن کاملLambda Unification
We give a formal description of an algorithm for lambda unification. The input to the algorithm consists of two terms t and s of lambda logic. The purpose of the algorithm is to find (sometimes) a substitution σ such that tσ = sσ is provable in lambda logic. In general such unifiers are not unique. Lambda logic itself is defined in [2]. We prove some basic metatheorems about lambda unification,...
متن کاملClones and Genoids in Lambda Calculus and First Order Logic
A genoid is a category of two objects such that one is the product of itself with the other. A genoid may be viewed as an abstract substitution algebra. It is a remarkable fact that such a simple concept can be applied to present a unified algebraic approach to lambda calculus and first order logic. Content : 0. Introduction. 1. Genoids. 2. Clones. 3. Binding Algebras 4. Lambda Calculus. 5. Fir...
متن کاملLinear Logic, Monads and the Lambda Calculus
Models of intuitionistic linear logic also provide models of Moggi's computational metalanguage. We use the adjoint presentation of these models and the associated adjoint calculus to show that three translations , due mainly to Moggi, of the lambda calculus into the computational metalanguage (direct, call-by-name and call-by-value) correspond exactly to three translations , due mainly to Gira...
متن کاملThe Calculus of Constructions and Higher Order Logic
The Calculus of Constructions (CC) ([Coquand 1985]) is a typed lambda calculus for higher order intuitionistic logic: proofs of the higher order logic are interpreted as lambda terms and formulas as types. It is also the union of Girard's system F ! ([Girard 1972]), a higher order typed lambda calculus, and a rst order dependent typed lambda calculus in the style of de Bruijn's Automath ([de Br...
متن کامل